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 listSep 1, 2026 06:38Victor MerckléVictor MerckléScore: 3,803Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 06:393,70639,141,35829,712,0001,053,0002,117,632stderr
2Sep 1, 2026 06:393,75639,592,79930,054,0001,125,0002,117,632stderr
3Sep 1, 2026 06:393,76939,652,44130,146,0001,139,0002,117,632stderr
4Sep 1, 2026 06:393,80239,968,11930,433,0001,125,0002,117,632stderr
5Sep 1, 2026 06:393,80339,981,57230,490,0001,083,0002,117,632stderr
6Sep 1, 2026 06:393,80639,946,51930,464,0001,132,0002,117,632stderr
7Sep 1, 2026 06:393,80840,666,10230,482,0001,129,0002,117,632stderr
8Sep 1, 2026 06:393,88040,616,71131,136,0001,075,0002,117,632stderr
9Sep 1, 2026 06:393,89940,749,23831,298,0001,069,0002,117,632stderr