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 3, 2025 06:34vonqovonqoScore: 2,067,852Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 3, 2025 06:342,067,54617,194,632,71317,084,671,00075,958,0002,285,568
2Nov 3, 2025 06:342,067,73617,193,565,88617,092,243,00069,964,0002,277,376
3Nov 3, 2025 06:342,067,77517,203,587,13117,101,564,00060,969,0002,281,472
4Nov 3, 2025 06:342,067,84217,192,808,92817,101,115,00061,971,0002,289,664
5Nov 3, 2025 06:342,067,85217,195,398,44317,102,202,00060,972,0002,285,568
6Nov 3, 2025 06:342,068,66817,199,499,89217,098,975,00070,966,0002,277,376
7Nov 3, 2025 06:342,071,26117,226,532,62117,132,500,00058,970,0002,277,376
8Nov 3, 2025 06:342,072,01117,235,629,01017,129,725,00067,967,0002,285,568
9Nov 3, 2025 06:342,075,37917,256,553,62117,140,689,00084,953,0002,260,992