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 19, 2026 01:03Ondřej PolaneckýOndřej PolaneckýScore: 184,428Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 19, 2026 01:04184,3481,539,794,4121,529,090,0001,005,0002,117,632stderr
2Jul 19, 2026 01:04184,3541,540,350,0421,529,047,0001,098,0002,117,632stderr
3Jul 19, 2026 01:04184,3681,539,950,8531,529,095,0001,166,0002,117,632stderr
4Jul 19, 2026 01:04184,3891,541,614,3241,529,237,0001,197,0002,117,632stderr
5Jul 19, 2026 01:04184,4281,543,283,6901,529,752,0001,002,0002,117,632stderr
6Jul 19, 2026 01:04184,4291,540,682,8101,529,635,0001,132,0002,117,632stderr
7Jul 19, 2026 01:04184,4481,540,605,8581,529,922,0001,002,0002,117,632stderr
8Jul 19, 2026 01:04184,5471,541,398,7431,530,610,0001,137,0002,117,632stderr
9Jul 19, 2026 01:04184,6101,541,976,9781,531,129,0001,139,0002,117,632stderr