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 02:57wnwnScore: 4,087Success
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 03:033,90641,191,77926,872,0005,555,00020,480
2Sep 24, 2026 03:033,92341,323,24926,853,0005,712,00020,480
3Sep 24, 2026 03:033,92841,413,16426,787,0005,816,0002,113,536
4Sep 24, 2026 03:034,06942,576,34326,574,0007,200,0002,113,536
5Sep 24, 2026 03:034,08742,672,38926,938,0006,986,0002,113,536
6Sep 24, 2026 03:034,11942,964,95026,857,0007,334,0002,113,536
7Sep 24, 2026 03:034,14143,107,41826,727,0007,647,00020,480
8Sep 24, 2026 03:034,29245,003,83427,779,0007,851,00020,480
9Sep 24, 2026 03:034,31346,765,00527,787,0008,016,0002,113,536