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 listFeb 11, 2026 18:32olliecrowolliecrowScore: 6,298Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2026 18:326,00078,595,20245,817,0003,984,0002,519,040
2Feb 11, 2026 18:326,04182,276,71347,129,0003,008,0002,437,120
3Feb 11, 2026 18:326,12376,489,72247,830,0002,989,0002,502,656
4Feb 11, 2026 18:326,29877,689,25247,245,0005,026,0002,363,392
5Feb 11, 2026 18:326,34977,734,83948,722,0003,977,0002,510,848
6Feb 11, 2026 18:326,42181,428,31950,278,0003,016,0002,433,024