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 listMar 10, 2026 20:33wnwnScore: 50,733Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 20:3150,367442,901,590417,050,0001,000,0002,490,368
2Mar 10, 2026 20:3350,369439,361,633417,064,0001,000,0002,273,280
3Mar 10, 2026 20:3150,371442,155,231417,076,0001,000,0002,490,368
4Mar 10, 2026 20:3350,733445,056,803420,082,0001,000,0002,498,560
5Mar 10, 2026 20:3350,745445,591,986420,180,0001,000,0002,527,232
6Mar 10, 2026 20:3150,807447,720,096419,704,0001,998,0002,490,368