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 29, 2026 01:20zielajzielajScore: 3,594Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 01:203,44654,511,89127,577,0001,021,0002,523,136
2Mar 29, 2026 01:203,47452,670,50827,838,000994,0002,527,232
3Mar 29, 2026 01:203,50552,460,49726,083,0003,009,0002,523,136
4Mar 29, 2026 01:203,59453,616,93128,840,000994,0002,433,024
5Mar 29, 2026 01:203,60047,616,58027,887,0001,991,0002,482,176
6Mar 29, 2026 01:203,61553,035,27128,006,0002,000,0002,445,312