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 10, 2026 02:26Victor MerckléVictor MerckléScore: 5,272Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 02:275,25251,252,40742,565,0001,032,0002,138,112
2Jun 10, 2026 02:275,25451,258,76542,588,0001,026,0002,138,112
3Jun 10, 2026 02:275,25651,358,67442,600,0001,026,0002,138,112
4Jun 10, 2026 02:275,27151,421,85842,725,0001,028,0002,138,112
5Jun 10, 2026 02:275,27251,501,60642,734,0001,027,0002,138,112
6Jun 10, 2026 02:275,27951,522,70442,782,0001,034,0002,138,112
7Jun 10, 2026 02:275,29351,563,05242,907,0001,027,0002,138,112
8Jun 10, 2026 02:275,30352,036,82342,991,0001,026,0002,138,112
9Jun 10, 2026 02:275,31252,858,37643,071,0001,024,0002,138,112