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 20, 2026 03:42M-RochatM-RochatScore: 61,211Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 03:4458,192494,000,957418,322,00064,673,0002,138,112
2May 20, 2026 03:4459,603505,746,175421,568,00073,138,0002,138,112
3May 20, 2026 03:4461,118518,573,567423,965,00083,320,0002,138,112
4May 20, 2026 03:4461,176516,209,531424,268,00083,494,0002,138,112
5May 20, 2026 03:4461,211517,752,113425,547,00082,511,0002,170,880
6May 20, 2026 03:4461,236519,271,581424,809,00083,457,0002,138,112
7May 20, 2026 03:4461,322518,312,755425,034,00083,945,0002,138,112
8May 20, 2026 03:4461,325518,242,672425,402,00083,599,0002,138,112
9May 20, 2026 03:4461,366517,771,876426,056,00083,287,0002,138,112