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 2, 2026 13:21limanjun99limanjun99Score: 23,244Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 2, 2026 13:2223,220206,380,503189,733,0002,995,0002,465,792
2May 2, 2026 13:2223,227210,406,010190,790,0001,997,0002,531,328
3May 2, 2026 13:2223,228212,224,674189,801,0002,996,0002,347,008
4May 2, 2026 13:2223,234208,783,995189,852,0002,997,0002,338,816
5May 2, 2026 13:2223,244210,439,380190,927,0001,999,0002,465,792
6May 2, 2026 13:2223,252215,386,438189,998,0002,999,0002,469,888
7May 2, 2026 13:2223,252211,923,931189,996,0002,999,0002,465,792
8May 2, 2026 13:2223,257209,688,132190,037,0003,000,0002,342,912
9May 2, 2026 13:2223,739217,134,038194,039,0003,000,0002,457,600