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 29, 2026 23:41olliecrowolliecrowScore: 15,281Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 23:4115,220141,723,288121,320,0005,013,0002,301,952
2Apr 29, 2026 23:4115,233139,994,110123,426,0003,010,0002,445,312
3Apr 29, 2026 23:4115,235142,088,684124,449,0002,007,0002,465,792
4Apr 29, 2026 23:4115,266142,250,208123,720,0002,993,0002,543,616
5Apr 29, 2026 23:4115,281142,771,171121,844,0004,993,0002,527,232
6Apr 29, 2026 23:4115,318142,562,190125,139,0002,002,0002,453,504
7Apr 29, 2026 23:4115,356144,788,448124,445,0003,010,0002,420,736
8Apr 29, 2026 23:4115,380141,005,381123,666,0003,989,0002,351,104
9Apr 29, 2026 23:4115,447147,428,977125,212,0003,005,0002,297,856