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 30, 2026 03:20Josu San MartinJosu San MartinScore: 6,200Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 30, 2026 03:205,98279,631,59648,640,0001,013,0002,445,312
2Jan 30, 2026 03:206,05878,230,60649,277,0001,005,0002,445,312
3Jan 30, 2026 03:206,14874,030,61049,030,0002,001,0002,445,312
4Jan 30, 2026 03:206,15769,134,26149,100,0002,004,0002,281,472
5Jan 30, 2026 03:206,18277,366,26550,308,0001,006,0002,285,568
6Jan 30, 2026 03:206,19674,612,30050,416,0001,008,0002,527,232
7Jan 30, 2026 03:206,20075,955,92450,450,0001,009,0002,285,568
8Jan 30, 2026 03:206,27273,253,14151,059,0001,001,0002,273,280
9Jan 30, 2026 03:206,27474,984,37450,069,0002,002,0002,285,568
10Jan 30, 2026 03:206,29179,560,06950,209,0002,008,0002,285,568
11Jan 30, 2026 03:206,31375,053,89951,387,0001,007,0002,547,712
12Jan 30, 2026 03:206,34177,555,93751,615,0001,012,0002,531,328