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 listSep 8, 2026 02:04Victor MerckléVictor MerckléScore: 103,222Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 02:07102,656860,709,054850,931,0001,116,0002,117,632stderr
2Sep 8, 2026 02:07103,059863,881,840854,306,0001,088,0002,117,632stderr
3Sep 8, 2026 02:07103,114864,863,438854,670,0001,178,0002,117,632stderr
4Sep 8, 2026 02:07103,165865,464,620855,071,0001,200,0002,117,632stderr
5Sep 8, 2026 02:07103,222865,295,945855,603,0001,141,0002,117,632stderr
6Sep 8, 2026 02:07103,363867,120,332856,826,0001,091,0002,117,632stderr
7Sep 8, 2026 02:07103,412868,087,911857,320,0001,002,0002,117,632stderr
8Sep 8, 2026 02:07103,443867,685,125857,497,0001,080,0002,117,632stderr
9Sep 8, 2026 02:07103,566868,114,603858,405,0001,197,0002,117,632stderr