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 26, 2026 15:10TudyMTudyMScore: 34,507Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 15:1034,486305,665,500284,239,0002,001,0002,473,984
2Apr 26, 2026 15:1034,487308,609,047284,247,0002,001,0002,322,432
3Apr 26, 2026 15:1034,496305,070,270285,323,0001,001,0002,383,872
4Apr 26, 2026 15:1034,501304,919,423285,358,0001,001,0002,383,872
5Apr 26, 2026 15:1034,507301,855,091285,409,0001,001,0002,379,776
6Apr 26, 2026 15:1034,508303,978,841285,423,0001,001,0002,375,680
7Apr 26, 2026 15:1034,512306,647,143284,448,0002,003,0002,379,776
8Apr 26, 2026 15:1034,514301,578,410285,470,0001,001,0002,318,336
9Apr 26, 2026 15:1034,517300,927,540284,492,0002,003,0002,322,432