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 listJul 12, 2026 13:03Kevin HeaveyKevin HeaveyScore: 4,472Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2026 13:044,44746,562,60235,700,0001,216,0002,117,632
2Jul 12, 2026 13:044,45646,615,49735,754,0001,239,0002,117,632
3Jul 12, 2026 13:044,45746,688,43635,771,0001,230,0002,117,632
4Jul 12, 2026 13:044,46646,704,85936,038,0001,038,0002,117,632
5Jul 12, 2026 13:044,47246,845,11636,085,0001,040,0002,117,632
6Jul 12, 2026 13:044,47246,762,29936,081,0001,037,0002,117,632
7Jul 12, 2026 13:044,56547,535,58636,862,0001,035,0002,117,632
8Jul 12, 2026 13:044,61847,981,52237,107,0001,223,0002,117,632
9Jul 12, 2026 13:044,65548,263,63237,607,0001,035,0002,117,632