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 listNov 20, 2025 15:41NicoNicoScore: 2,045,637Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 20, 2025 15:412,043,15416,992,230,15016,886,213,00071,966,0002,285,568
2Nov 20, 2025 15:412,044,18317,002,248,60716,898,750,00067,966,0002,277,376
3Nov 20, 2025 15:412,044,24616,996,713,05916,912,265,00054,974,0002,277,376
4Nov 20, 2025 15:412,044,65917,004,549,31616,915,698,00054,973,0002,285,568
5Nov 20, 2025 15:412,045,63717,012,462,87816,917,816,00060,974,0002,277,376
6Nov 20, 2025 15:412,046,84817,023,333,56516,915,866,00072,969,0002,277,376
7Nov 20, 2025 15:412,047,77417,029,023,57816,922,564,00073,958,0002,277,376
8Nov 20, 2025 15:412,058,29317,116,564,88317,019,864,00063,965,0002,285,568
9Nov 20, 2025 15:412,156,72117,937,454,63217,815,827,00084,961,0002,289,664