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 31, 2026 02:13zielajzielajScore: 3,437Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 31, 2026 02:133,42549,639,67027,414,0001,015,0002,437,120
2Mar 31, 2026 02:133,43353,226,47427,474,0001,017,0002,441,216
3Mar 31, 2026 02:133,43748,410,87627,508,0001,018,0002,531,328
4Mar 31, 2026 02:133,43757,317,86927,506,0001,018,0002,523,136
5Mar 31, 2026 02:133,44654,819,76227,577,0001,021,0002,527,232
6Mar 31, 2026 02:133,44651,289,87727,584,0001,021,0002,535,424