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 2, 2026 04:15Josu San MartinJosu San MartinScore: 7,487Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 04:157,28084,345,04757,407,0003,021,0002,359,296
2Jan 2, 2026 04:157,30685,329,61059,629,0001,010,0002,379,776
3Jan 2, 2026 04:157,37281,200,53258,180,0003,009,0002,514,944
4Jan 2, 2026 04:157,42090,103,86959,567,0002,019,0002,330,624
5Jan 2, 2026 04:157,45190,803,39859,847,0001,994,0002,379,776
6Jan 2, 2026 04:157,46490,105,71659,951,0001,998,0002,469,888
7Jan 2, 2026 04:157,48785,235,53460,140,0002,004,0002,416,640
8Jan 2, 2026 04:157,54385,244,05259,628,0002,981,0002,392,064
9Jan 2, 2026 04:157,56489,123,48557,800,0004,982,0002,506,752
10Jan 2, 2026 04:157,56695,936,14559,807,0002,990,0002,342,912
11Jan 2, 2026 04:157,57684,788,67659,889,0002,994,0002,490,368
12Jan 2, 2026 04:157,58085,089,78759,915,0002,995,0002,285,568