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 24, 2026 11:56wnwnScore: 3,471Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 11:593,33336,222,69826,597,0001,067,0002,113,536
2Sep 24, 2026 11:593,44737,989,36027,587,0001,026,0002,113,536
3Sep 24, 2026 11:593,45038,656,45627,622,0001,013,0002,113,536
4Sep 24, 2026 11:593,46437,352,45527,721,0001,031,0002,113,536
5Sep 24, 2026 11:593,47138,207,34727,805,0001,005,0002,113,536
6Sep 24, 2026 11:593,47537,656,35427,828,0001,020,0002,113,536
7Sep 24, 2026 11:593,47537,587,07527,840,0001,007,0002,113,536
8Sep 24, 2026 11:593,48038,448,08027,885,0001,003,0002,113,536
9Sep 24, 2026 11:593,48538,364,94427,922,0001,007,0002,113,536