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 26, 2026 16:23Kevin HeaveyKevin HeaveyScore: 3,191Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2026 16:263,17735,048,52026,374,000020,480
2Sep 26, 2026 16:263,18236,779,64226,412,000020,480
3Sep 26, 2026 16:263,18535,059,12326,440,000020,480
4Sep 26, 2026 16:263,18535,035,51526,439,000020,480
5Sep 26, 2026 16:263,19135,107,06826,486,000020,480
6Sep 26, 2026 16:263,19235,171,88226,498,000020,480
7Sep 26, 2026 16:263,19535,187,39726,525,000020,480
8Sep 26, 2026 16:263,20235,232,75126,578,000020,480
9Sep 26, 2026 16:263,20335,247,53226,591,000020,480