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 26, 2026 10:40Victor MerckléVictor MerckléScore: 4,179Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 10:424,16242,302,75533,408,0001,144,0002,117,632stderr
2Jun 26, 2026 10:424,16542,397,20333,477,0001,099,0002,117,632stderr
3Jun 26, 2026 10:424,17742,409,97533,544,0001,126,0002,117,632stderr
4Jun 26, 2026 10:424,17842,121,38433,578,0001,101,0002,117,632stderr
5Jun 26, 2026 10:424,17942,394,61533,596,0001,097,0002,117,632stderr
6Jun 26, 2026 10:424,19042,261,39633,753,0001,024,0002,117,632stderr
7Jun 26, 2026 10:424,20342,575,54033,769,0001,119,0002,117,632stderr
8Jun 26, 2026 10:424,21442,439,46233,880,0001,097,0002,117,632stderr
9Jun 26, 2026 10:424,36543,913,74935,136,0001,095,0002,117,632stderr