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 22, 2026 13:39SneedSneedScore: 76,378Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2026 13:4176,268655,305,263566,021,00067,002,0002,387,968
2Feb 22, 2026 13:3976,334658,520,348573,616,00059,959,0002,289,664
3Feb 22, 2026 13:4176,363662,362,661571,832,00061,981,0002,277,376
4Feb 22, 2026 13:3976,378659,860,137560,944,00072,992,0002,281,472
5Feb 22, 2026 13:4176,573665,074,595574,601,00060,957,0002,277,376
6Feb 22, 2026 13:3976,762663,904,230576,113,00061,012,0002,514,944