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:27Josu San MartinJosu San MartinScore: 6,219Success
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:275,96875,065,54248,527,0001,010,0002,535,424
2Jan 30, 2026 03:276,20770,517,38350,506,0001,010,0002,449,408
3Jan 30, 2026 03:276,21077,775,18450,531,0001,010,0002,449,408
4Jan 30, 2026 03:276,21973,934,13150,609,0001,012,0002,437,120
5Jan 30, 2026 03:276,30578,857,92650,320,0002,012,0002,449,408
6Jan 30, 2026 03:276,31677,311,02651,416,0001,008,0002,285,568