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 14, 2026 19:04Elijah KinElijah KinScore: 65,785Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2026 19:0465,675570,346,263494,093,00051,009,0002,277,376
2Mar 14, 2026 19:0465,684572,061,456490,157,00055,017,0002,285,568
3Mar 14, 2026 19:0465,753574,554,611492,772,00052,975,0002,285,568
4Mar 14, 2026 19:0465,771575,941,046488,908,00056,989,0002,277,376
5Mar 14, 2026 19:0465,785572,541,691491,015,00055,001,0002,482,176
6Mar 14, 2026 19:0465,840568,250,060489,528,00056,945,0002,469,888
7Mar 14, 2026 19:0465,853574,072,185493,624,00052,959,0002,277,376
8Mar 14, 2026 19:0465,858579,039,166495,658,00050,964,0002,285,568
9Mar 14, 2026 19:0465,881570,051,956493,832,00052,982,0002,486,272