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:30Josu San MartinJosu San MartinScore: 6,483Success
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:306,36472,911,77050,831,0001,993,0002,273,280
2Jan 30, 2026 03:306,45783,281,45552,585,0001,011,0002,265,088
3Jan 30, 2026 03:306,48180,793,59352,798,000996,0002,277,376
4Jan 30, 2026 03:306,48383,663,04751,819,0001,993,0002,441,216
5Jan 30, 2026 03:306,48382,508,23651,815,0001,992,0002,449,408
6Jan 30, 2026 03:306,50779,087,61152,012,0002,000,0002,285,568