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 listMar 12, 2026 13:12Sergey SerebryakovSergey SerebryakovScore: 7,875Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 12, 2026 13:127,51884,250,68861,394,0001,006,0002,445,312
2Mar 12, 2026 13:127,51987,208,80761,398,0001,006,0002,277,376
3Mar 12, 2026 13:127,85090,135,79864,153,0001,002,0002,277,376
4Mar 12, 2026 13:127,87594,787,93064,358,0001,005,0002,277,376
5Mar 12, 2026 13:129,163103,067,95774,054,0002,001,0002,441,216
6Mar 12, 2026 13:129,225101,562,77975,563,0001,007,0002,277,376