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 listAug 30, 2026 18:22Josu San MartinJosu San MartinScore: 4,346Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 18:224,32144,443,08934,791,0001,081,0002,113,536
2Aug 30, 2026 18:224,32544,356,91634,821,0001,082,0002,113,536
3Aug 30, 2026 18:224,33744,480,92034,893,0001,109,0002,113,536
4Aug 30, 2026 18:224,34444,507,29534,944,0001,117,0002,113,536
5Aug 30, 2026 18:224,34644,531,92734,968,0001,110,0002,113,536
6Aug 30, 2026 18:224,34844,587,37834,972,0001,123,0002,113,536
7Aug 30, 2026 18:224,35544,692,09835,042,0001,110,0002,113,536
8Aug 30, 2026 18:224,37744,779,67135,178,0001,156,0002,113,536
9Aug 30, 2026 18:224,48445,681,03436,099,0001,123,0002,113,536