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 listFeb 23, 2026 19:24Kacper GrzybowskiKacper GrzybowskiScore: 64,340Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 23, 2026 19:2464,204559,837,911476,904,00055,988,0002,277,376
2Feb 23, 2026 19:2464,233562,156,220479,117,00054,013,0002,412,544
3Feb 23, 2026 19:2464,275562,946,704477,431,00056,050,0002,277,376
4Feb 23, 2026 19:2464,315559,240,506474,838,00058,979,0002,277,376
5Feb 23, 2026 19:2464,340561,032,417470,021,00064,002,0002,277,376
6Feb 23, 2026 19:2464,341564,898,762479,031,00055,003,0002,277,376
7Feb 23, 2026 19:2464,353556,855,210473,119,00061,015,0002,277,376
8Feb 23, 2026 19:2464,368558,503,047479,230,00055,026,0002,277,376
9Feb 23, 2026 19:2464,429558,858,333475,789,00058,973,0002,277,376