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 listMar 17, 2026 10:50limanjun99limanjun99Score: 6,033Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 10:506,01672,691,95248,937,000998,0002,498,560
2Mar 17, 2026 10:506,02172,749,12247,978,0001,999,0002,494,464
3Mar 17, 2026 10:506,02671,896,48948,015,0002,000,0002,289,664
4Mar 17, 2026 10:506,02775,193,94547,020,0003,001,0002,289,664
5Mar 17, 2026 10:506,03376,463,41748,069,0002,002,0002,289,664
6Mar 17, 2026 10:506,03972,817,01948,116,0002,004,0002,490,368
7Mar 17, 2026 10:506,04077,196,03348,128,0002,005,0002,289,664
8Mar 17, 2026 10:506,05076,486,14748,203,0002,008,0002,289,664
9Mar 17, 2026 10:506,14380,928,91748,991,0001,999,0002,289,664