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 listJun 29, 2026 03:21Victor MerckléVictor MerckléScore: 47,493Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 03:2347,394401,132,506392,351,0001,025,0002,117,632stderr
2Jun 29, 2026 03:2347,427401,373,743392,642,0001,003,0002,117,632stderr
3Jun 29, 2026 03:2347,433401,517,211392,629,0001,068,0002,117,632stderr
4Jun 29, 2026 03:2347,466401,743,008392,835,0001,136,0002,117,632stderr
5Jun 29, 2026 03:2347,493401,933,533393,104,0001,089,0002,117,632stderr
6Jun 29, 2026 03:2347,503402,017,082393,262,0001,021,0002,117,632stderr
7Jun 29, 2026 03:2347,529402,225,322393,494,0001,000,0002,117,632stderr
8Jun 29, 2026 03:2347,550402,387,994393,559,0001,112,0002,117,632stderr
9Jun 29, 2026 03:2347,564402,550,650393,654,0001,130,0002,117,632stderr