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 11, 2026 06:52wnwnScore: 3,328Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 06:523,29735,965,07927,366,00002,113,536
2May 11, 2026 06:523,30236,379,26327,410,00002,113,536
3May 11, 2026 06:523,31034,755,73727,478,00002,113,536
4May 11, 2026 06:523,31137,803,38526,470,0001,012,0002,113,536
5May 11, 2026 06:523,32834,875,98427,628,00002,113,536
6May 11, 2026 06:523,47238,813,82028,821,00002,113,536
7May 11, 2026 06:523,47638,928,74128,855,00002,113,536
8May 11, 2026 06:523,49839,804,22029,037,00002,113,536
9May 11, 2026 06:523,51038,909,61329,141,00002,113,536