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:16Josu San MartinJosu San MartinScore: 8,050Success
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:167,935101,748,14462,871,0002,993,0002,514,944
2Jan 30, 2026 03:167,99984,311,62865,383,0001,005,0002,326,528
3Jan 30, 2026 03:168,04691,348,18264,785,0001,993,0002,334,720
4Jan 30, 2026 03:168,05093,016,43363,822,0002,991,0002,334,720
5Jan 30, 2026 03:168,12293,652,21665,400,0002,012,0002,306,048
6Jan 30, 2026 03:168,445100,461,60167,089,0003,004,0002,338,816