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 listApr 12, 2026 03:56Josu San MartinJosu San MartinScore: 5,104Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 12, 2026 03:565,07671,711,37939,120,0003,009,0002,523,136
2Apr 12, 2026 03:565,10467,995,11939,338,0003,026,0002,297,856
3Apr 12, 2026 03:565,44470,264,91743,175,0002,008,0002,281,472