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 listMay 11, 2026 20:10TudyMTudyMScore: 30,464Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 20:1130,444261,701,751251,680,0001,008,0002,113,536
2May 11, 2026 20:1130,456264,022,340251,778,0001,008,0002,113,536
3May 11, 2026 20:1130,457261,466,335251,787,0001,009,0002,113,536
4May 11, 2026 20:1130,459262,872,867251,806,0001,007,0002,113,536
5May 11, 2026 20:1130,464261,566,754251,845,0001,008,0002,113,536
6May 11, 2026 20:1130,470261,624,917251,894,0001,007,0002,113,536
7May 11, 2026 20:1130,481263,528,458251,988,0001,006,0002,113,536
8May 11, 2026 20:1130,570262,492,210251,489,0002,249,0002,113,536
9May 11, 2026 20:1130,587265,592,736251,857,0002,018,0002,113,536