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 listMay 14, 2026 21:24Victor MerckléVictor MerckléScore: 60,817Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 21:2560,800514,060,849503,639,0001,004,0002,117,632stderr
2May 14, 2026 21:2560,803511,902,875503,665,0001,004,0002,117,632stderr
3May 14, 2026 21:2560,812512,119,477503,740,0001,003,0002,117,632stderr
4May 14, 2026 21:2560,812512,066,792503,738,0001,003,0002,117,632stderr
5May 14, 2026 21:2560,817512,162,678503,782,0001,005,0002,117,632stderr
6May 14, 2026 21:2560,830513,265,652503,892,0001,004,0002,117,632stderr
7May 14, 2026 21:2560,830513,304,898503,892,0001,004,0002,117,632stderr
8May 14, 2026 21:2560,838512,355,091503,953,0001,004,0002,117,632stderr
9May 14, 2026 21:2560,840512,316,022503,974,0001,004,0002,117,632stderr