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 07:56Victor MerckléVictor MerckléScore: 58,536Success
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 07:5658,519495,901,737483,600,0002,110,0002,117,632stderr
2May 14, 2026 07:5658,523495,001,291483,633,0002,111,0002,117,632stderr
3May 14, 2026 07:5658,528496,365,229483,739,0002,046,0002,117,632stderr
4May 14, 2026 07:5658,534494,174,153483,829,0002,007,0002,117,632stderr
5May 14, 2026 07:5658,536493,128,766483,832,0002,017,0002,117,632stderr
6May 14, 2026 07:5658,539493,350,188483,857,0002,018,0002,117,632stderr
7May 14, 2026 07:5658,553494,247,595483,971,0002,021,0002,117,632stderr
8May 14, 2026 07:5658,553493,308,349483,983,0002,011,0002,117,632stderr
9May 14, 2026 07:5658,573493,937,061484,059,0002,102,0002,117,632stderr