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 25, 2026 20:14Victor MerckléVictor MerckléScore: 4,169Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 20:154,15942,047,30733,415,0001,106,0002,113,536
2Jun 25, 2026 20:154,16042,351,64333,411,0001,121,0002,113,536
3Jun 25, 2026 20:154,16242,115,39833,445,0001,104,0002,113,536
4Jun 25, 2026 20:154,16342,169,15833,534,0001,020,0002,113,536
5Jun 25, 2026 20:154,16942,242,17333,498,0001,108,0002,113,536
6Jun 25, 2026 20:154,17242,217,01633,531,0001,097,0002,113,536
7Jun 25, 2026 20:154,20142,343,95633,863,0001,009,0002,113,536
8Jun 25, 2026 20:154,20942,469,00733,801,0001,139,0002,113,536
9Jun 25, 2026 20:154,30343,191,17034,628,0001,095,0002,113,536