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 3, 2026 04:43limanjun99limanjun99Score: 9,253Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 04:449,19594,258,13570,294,0006,025,0002,420,736
2May 3, 2026 04:449,19998,681,02770,331,0006,028,0002,420,736
3May 3, 2026 04:449,21698,944,02071,468,0005,032,0002,408,448
4May 3, 2026 04:449,23899,561,52169,708,0006,970,0002,416,640
5May 3, 2026 04:449,25390,658,15870,821,0005,984,0002,428,928
6May 3, 2026 04:449,26495,720,61169,909,0006,990,0002,416,640
7May 3, 2026 04:449,421101,124,24472,180,0006,015,0002,412,544
8May 3, 2026 04:449,49699,645,17671,836,0006,984,0002,445,312
9May 3, 2026 04:449,50692,562,46072,911,0005,992,0002,490,368