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 4, 2026 21:32M-RochatM-RochatScore: 20,539Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 21:3320,215197,005,600166,628,0001,158,0002,465,792
2May 4, 2026 21:3320,279184,493,142167,184,0001,139,0002,457,600
3May 4, 2026 21:3320,327198,541,829167,706,0001,010,0002,469,888
4May 4, 2026 21:3320,398185,757,357168,201,0001,109,0002,473,984
5May 4, 2026 21:3320,539198,098,051168,374,0002,107,0002,310,144
6May 4, 2026 21:3320,554195,385,061169,596,0001,008,0002,461,696
7May 4, 2026 21:3320,612188,391,116169,945,0001,140,0002,473,984
8May 4, 2026 21:3320,673185,947,487170,431,0001,162,0002,461,696
9May 4, 2026 21:3320,857205,145,949171,086,0002,032,0002,314,240