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 listJun 26, 2026 18:35Josu San MartinJosu San MartinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 18:35041,996,75932,704,0001,177,0002,113,536expected "53686417979017599 ", got "53686417723017599 "
2Jun 26, 2026 18:35041,717,64232,406,0001,178,0002,113,536expected "53688143681153743 ", got "53688143425153743 "
3Jun 26, 2026 18:354,04341,096,60532,432,0001,128,0002,113,536
4Jun 26, 2026 18:354,04941,109,66032,602,0001,009,0002,113,536
5Jun 26, 2026 18:354,06641,356,04732,580,0001,168,0002,113,536
6Jun 26, 2026 18:354,09542,128,15732,835,0001,161,0002,113,536
7Jun 26, 2026 18:354,11041,671,31532,952,0001,164,0002,113,536
8Jun 26, 2026 18:354,11341,900,99032,998,0001,147,0002,113,536
9Jun 26, 2026 18:354,20643,026,83933,897,0001,014,0002,113,536