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 listJul 9, 2026 12:51Victor MerckléVictor MerckléScore: 73,356Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 12:5172,671611,233,929602,083,0001,093,0002,117,632stderr
2Jul 9, 2026 12:5172,817612,503,603603,305,0001,077,0002,117,632stderr
3Jul 9, 2026 12:5173,169615,191,288606,184,0001,125,0002,117,632stderr
4Jul 9, 2026 12:5173,181615,274,281606,283,0001,121,0002,117,632stderr
5Jul 9, 2026 12:5173,356616,984,042607,842,0001,013,0002,117,632stderr
6Jul 9, 2026 12:5173,552618,696,754609,475,0001,007,0002,117,632stderr
7Jul 9, 2026 12:5173,872621,263,916612,142,0001,003,0002,117,632stderr
8Jul 9, 2026 12:5173,947621,826,440612,670,0001,098,0002,117,632stderr
9Jul 9, 2026 12:5175,013630,685,332621,498,0001,111,0002,117,632stderr