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 24, 2026 08:23Dominique GarmierDominique GarmierScore: 7,639Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 08:287,48376,137,32559,110,0003,005,0002,465,792
2Apr 24, 2026 08:287,50580,868,67960,288,0002,009,0002,469,888
3Apr 24, 2026 08:287,52682,764,86560,453,0002,015,0002,478,080
4Apr 24, 2026 08:287,62777,727,70160,292,0003,014,0002,461,696
5Apr 24, 2026 08:287,63982,493,72562,399,0001,006,0002,465,792
6Apr 24, 2026 08:287,74983,091,75362,314,0002,010,0002,465,792
7Apr 24, 2026 08:287,75379,441,43662,343,0002,011,0002,473,984
8Apr 24, 2026 08:287,76184,678,97762,410,0002,013,0002,457,600
9Apr 24, 2026 08:287,82580,610,64563,952,000999,0002,465,792