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 5, 2026 12:57wnwnScore: 3,337Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 12:593,31536,191,28126,490,0001,027,0002,113,536
2Sep 5, 2026 12:593,32236,035,12226,573,0001,001,0002,113,536
3Sep 5, 2026 12:593,32436,055,10526,563,0001,034,0002,113,536
4Sep 5, 2026 12:593,32537,529,74926,585,0001,020,0002,113,536
5Sep 5, 2026 12:593,33736,155,17926,702,0001,001,0002,113,536
6Sep 5, 2026 12:593,35036,213,50526,757,0001,050,0002,113,536
7Sep 5, 2026 12:593,42346,781,00927,352,0001,064,0002,113,536
8Sep 5, 2026 12:593,46737,001,88427,762,0001,015,0002,113,536
9Sep 5, 2026 12:593,57338,847,60328,661,0001,003,0002,113,536