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 listJan 11, 2026 08:39Pavel SkripkinPavel SkripkinScore: 39,994Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2026 08:3939,512349,710,648325,949,0001,999,0002,289,664
2Jan 11, 2026 08:3939,547352,321,846327,244,0001,000,0002,355,200
3Jan 11, 2026 08:3939,553350,953,523327,289,0001,000,0002,289,664
4Jan 11, 2026 08:3939,985356,062,139329,878,0001,999,0002,289,664
5Jan 11, 2026 08:3939,994354,018,238329,955,0001,999,0002,461,696
6Jan 11, 2026 08:3940,024358,974,283331,198,0001,000,0002,351,104
7Jan 11, 2026 08:3940,561365,050,172334,658,0001,997,0002,289,664
8Jan 11, 2026 08:3940,563365,600,432335,673,000999,0002,289,664
9Jan 11, 2026 08:3940,636369,843,787337,282,00002,289,664