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 listOct 20, 2026 10:52timothygktimothygkScore: 62,042Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 20, 2026 10:5361,651523,241,686498,122,00013,582,00028,672stderr
2Oct 20, 2026 10:5361,841524,647,297498,544,00014,739,00028,672stderr
3Oct 20, 2026 10:5361,982525,904,367500,352,00014,104,0002,121,728stderr
4Oct 20, 2026 10:5362,012526,158,829501,217,00013,485,00028,672stderr
5Oct 20, 2026 10:5362,042525,825,107498,512,00016,440,0002,121,728stderr
6Oct 20, 2026 10:5362,113526,584,382501,055,00014,491,0002,121,728stderr
7Oct 20, 2026 10:5362,124526,606,294500,226,00015,406,00028,672stderr
8Oct 20, 2026 10:5362,478529,510,317501,828,00016,742,00024,576stderr
9Oct 20, 2026 10:5362,744531,771,858503,653,00017,124,0002,121,728stderr