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 listFeb 19, 2026 04:59Josu San MartinJosu San MartinScore: 6,300Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 04:596,15375,208,41447,065,0004,005,0002,269,184
2Feb 19, 2026 04:596,30076,970,89449,276,0003,016,0002,285,568
3Feb 19, 2026 04:596,45384,625,52551,539,0002,021,0002,301,952