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 listMay 14, 2026 09:05Victor MerckléVictor MerckléScore: 58,743Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 09:0558,737496,735,218486,515,0001,004,0002,117,632stderr
2May 14, 2026 09:0558,738496,553,486486,529,0001,004,0002,117,632stderr
3May 14, 2026 09:0558,741497,773,217486,554,0001,002,0002,117,632stderr
4May 14, 2026 09:0558,743497,211,349486,565,0001,003,0002,117,632stderr
5May 14, 2026 09:0558,743497,375,352486,569,0001,004,0002,117,632stderr
6May 14, 2026 09:0558,744496,702,859486,574,0001,003,0002,117,632stderr
7May 14, 2026 09:0558,746497,224,774486,592,0001,003,0002,117,632stderr
8May 14, 2026 09:0558,748497,921,138486,606,0001,004,0002,117,632stderr
9May 14, 2026 09:0558,750497,887,777486,627,0001,004,0002,117,632stderr