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 listMay 8, 2026 18:09Hung T.NguyenHung T.NguyenScore: 50,126Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 8, 2026 18:0949,748433,203,245411,874,0001,037,0002,379,776
2May 8, 2026 18:0949,759429,555,325411,890,0001,115,0002,383,872
3May 8, 2026 18:0949,889431,777,855413,027,0001,052,0002,375,680
4May 8, 2026 18:0950,087432,191,858414,721,0001,002,0002,371,584
5May 8, 2026 18:0950,126435,182,027414,980,0001,070,0002,371,584
6May 8, 2026 18:0950,131433,228,425415,062,0001,028,0002,367,488
7May 8, 2026 18:0950,223437,184,091415,766,0001,086,0002,379,776
8May 8, 2026 18:0950,408438,785,600417,303,0001,089,0002,367,488
9May 8, 2026 18:0950,793437,414,128420,488,0001,099,0002,367,488