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 07:43Victor MerckléVictor MerckléScore: 3,741Success
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 07:443,66938,788,35229,193,0001,262,0002,117,632stderr
2Sep 1, 2026 07:443,70339,049,69429,452,0001,285,0002,117,632stderr
3Sep 1, 2026 07:443,72539,946,12429,672,0001,248,0002,117,632stderr
4Sep 1, 2026 07:443,72639,236,33129,668,0001,261,0002,117,632stderr
5Sep 1, 2026 07:443,74141,226,86529,834,0001,224,0002,117,632stderr
6Sep 1, 2026 07:443,75439,551,68529,890,0001,269,0002,117,632stderr
7Sep 1, 2026 07:443,75539,528,53429,901,0001,270,0002,117,632stderr
8Sep 1, 2026 07:443,77139,716,60730,035,0001,270,0002,117,632stderr
9Sep 1, 2026 07:443,78539,752,61230,374,0001,047,0002,117,632stderr