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 listAug 11, 2026 20:49Victor MerckléVictor MerckléScore: 11,010Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 20:5010,85398,471,90584,837,0005,246,0002,117,632stderr
2Aug 11, 2026 20:5010,92799,012,97785,386,0005,314,0002,117,632stderr
3Aug 11, 2026 20:5010,954100,437,02285,621,0005,302,0002,117,632stderr
4Aug 11, 2026 20:5011,00699,781,66985,845,0005,508,0002,117,632stderr
5Aug 11, 2026 20:5011,01099,848,80685,787,0005,602,0002,117,632stderr
6Aug 11, 2026 20:5011,039100,514,37285,896,0005,734,0002,117,632stderr
7Aug 11, 2026 20:5011,051100,448,99786,407,0005,318,0002,117,632stderr
8Aug 11, 2026 20:5011,116100,698,89786,724,0005,547,0002,117,632stderr
9Aug 11, 2026 20:5011,117100,600,18686,934,0005,343,0002,117,632stderr