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 listApr 26, 2026 16:02olliecrowolliecrowScore: 8,510Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 16:048,44378,260,09167,074,0003,003,0002,465,792
2Apr 26, 2026 16:048,45678,371,86168,181,0002,005,0002,449,408
3Apr 26, 2026 16:048,47978,585,31966,356,0004,021,0002,482,176
4Apr 26, 2026 16:048,49788,779,07168,512,0002,015,0002,408,448
5Apr 26, 2026 16:048,51077,883,20866,603,0004,036,0002,514,944
6Apr 26, 2026 16:048,55185,321,13867,976,0002,998,0002,433,024
7Apr 26, 2026 16:048,71682,794,87569,329,0003,014,0002,400,256
8Apr 26, 2026 16:048,86381,731,46669,538,0004,031,0002,318,336
9Apr 26, 2026 16:048,88190,719,66572,707,0001,009,0002,408,448