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 09:52Joel ChongJoel ChongScore: 50,126Success
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 09:5249,979442,215,403412,830,0001,999,0002,277,376
2Mar 17, 2026 09:5250,072440,848,075412,604,0002,997,0002,277,376
3Mar 17, 2026 09:5250,108438,022,537414,896,000999,0002,285,568
4Mar 17, 2026 09:5250,115439,825,202413,959,0001,999,0002,285,568
5Mar 17, 2026 09:5250,126439,004,406414,047,0002,000,0002,285,568
6Mar 17, 2026 09:5250,133436,887,345415,106,0001,000,0002,285,568
7Mar 17, 2026 09:5250,143442,252,012416,187,00002,277,376
8Mar 17, 2026 09:5250,193447,960,823414,601,0001,998,0002,285,568
9Mar 17, 2026 09:5250,194444,119,248414,609,0001,998,0002,285,568