Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listAug 30, 2026 18:39Josu San MartinJosu San MartinScore: 4,354Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 18:394,34144,492,58434,893,0001,141,0002,113,536
2Aug 30, 2026 18:394,34644,544,71634,948,0001,131,0002,113,536
3Aug 30, 2026 18:394,34744,509,16934,978,0001,106,0002,113,536
4Aug 30, 2026 18:394,35044,604,96234,961,0001,146,0002,113,536
5Aug 30, 2026 18:394,35444,609,33235,012,0001,128,0002,113,536
6Aug 30, 2026 18:394,36044,624,77435,060,0001,128,0002,113,536
7Aug 30, 2026 18:394,36344,723,43535,088,0001,132,0002,113,536
8Aug 30, 2026 18:394,36744,754,19235,133,0001,120,0002,113,536
9Aug 30, 2026 18:394,36844,732,06735,144,0001,114,0002,113,536