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 9, 2026 19:56Victor MerckléVictor MerckléScore: 19,742Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 19:5819,514169,976,506160,901,0001,070,0002,117,632stderr
2Jul 9, 2026 19:5819,616170,906,178161,804,0001,014,0002,117,632stderr
3Jul 9, 2026 19:5819,623172,526,725161,870,0001,009,0002,117,632stderr
4Jul 9, 2026 19:5819,644171,328,827161,996,0001,050,0002,117,632stderr
5Jul 9, 2026 19:5819,742171,813,553162,785,0001,074,0002,117,632stderr
6Jul 9, 2026 19:5819,757172,084,240162,972,0001,017,0002,117,632stderr
7Jul 9, 2026 19:5819,801172,479,756163,294,0001,061,0002,117,632stderr
8Jul 9, 2026 19:5819,868172,844,613163,865,0001,045,0002,117,632stderr
9Jul 9, 2026 19:5819,954173,566,166164,591,0001,032,0002,117,632stderr