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 listMar 28, 2026 02:42zielajzielajScore: 3,576Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 28, 2026 02:403,43950,000,83927,522,0001,019,0002,449,408
2Mar 28, 2026 02:403,44351,320,33227,559,0001,020,0002,523,136
3Mar 28, 2026 02:403,56257,204,31628,548,0001,019,0002,523,136
4Mar 28, 2026 02:423,57657,425,32328,658,0001,023,0002,441,216
5Mar 28, 2026 02:423,79353,012,46330,469,0001,015,0002,519,040
6Mar 28, 2026 02:423,90663,557,00531,409,0001,013,0002,441,216