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 listFeb 19, 2026 05:08Josu San MartinJosu San MartinScore: 6,034Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 05:085,86277,381,27046,627,0002,027,0002,396,160
2Feb 19, 2026 05:085,90872,120,90848,037,0001,000,0002,277,376
3Feb 19, 2026 05:085,98278,141,57549,651,00002,396,160
4Feb 19, 2026 05:086,03476,217,05346,080,0004,006,0002,281,472
5Feb 19, 2026 05:086,12277,184,57549,817,000996,0002,281,472
6Feb 19, 2026 05:086,20076,850,30951,457,00002,277,376