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 5, 2026 16:35M-RochatM-RochatScore: 19,730Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 16:3519,676181,465,946162,100,0001,212,0002,457,600
2May 5, 2026 16:3519,678180,684,496162,141,0001,191,0002,482,176
3May 5, 2026 16:3519,692181,841,593162,282,0001,167,0002,465,792
4May 5, 2026 16:3519,718179,605,489162,545,0001,119,0002,478,080
5May 5, 2026 16:3519,730180,654,611162,595,0001,170,0002,461,696
6May 5, 2026 16:3519,829181,850,922163,447,0001,139,0002,473,984
7May 5, 2026 16:3519,838180,957,998163,489,0001,172,0002,469,888
8May 5, 2026 16:3519,930182,352,422164,276,0001,149,0002,469,888
9May 5, 2026 16:3520,069184,876,958165,420,0001,157,0002,482,176