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 04:44Josu San MartinJosu San MartinScore: 6,760Success
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 04:446,52276,050,97052,127,0002,004,0002,445,312
2Jan 30, 2026 04:446,54975,653,30553,347,0001,006,0002,273,280
3Jan 30, 2026 04:446,58682,106,51053,650,0001,012,0002,433,024
4Jan 30, 2026 04:446,76077,525,02954,105,0002,003,0002,531,328
5Jan 30, 2026 04:446,81383,475,58555,538,0001,009,0002,273,280
6Jan 30, 2026 04:446,89881,833,10355,248,0002,009,0002,285,568