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 24, 2026 18:28Kacper GrzybowskiKacper GrzybowskiScore: 48,754Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 18:2848,620427,368,096349,605,00053,939,0002,277,376
2Feb 24, 2026 18:2848,709432,622,556348,244,00056,039,0002,277,376
3Feb 24, 2026 18:2848,712428,603,897343,261,00061,046,0002,412,544
4Feb 24, 2026 18:2848,723429,332,340348,344,00056,055,0002,404,352
5Feb 24, 2026 18:2848,754427,923,673346,711,00057,951,0002,412,544
6Feb 24, 2026 18:2848,775425,943,811347,859,00056,977,0002,408,448
7Feb 24, 2026 18:2848,783434,422,437346,913,00057,985,0002,277,376
8Feb 24, 2026 18:2848,844434,465,280350,484,00054,919,0002,404,352
9Feb 24, 2026 18:2848,882431,551,962348,757,00056,960,0002,277,376