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 19:51wnwnScore: 4,375Success
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 19:514,32061,133,25933,862,0001,991,0002,490,368
2Mar 10, 2026 19:514,32659,509,65333,911,0001,994,0002,486,272
3Mar 10, 2026 19:514,33360,419,35633,968,0001,998,0002,494,464
4Mar 10, 2026 19:514,35656,862,30934,150,0002,008,0002,494,464
5Mar 10, 2026 19:514,37553,493,97435,305,0001,008,0002,494,464
6Mar 10, 2026 19:514,40057,103,53135,503,0001,014,0002,273,280
7Mar 10, 2026 19:514,40763,785,97435,563,0001,016,0002,490,368
8Mar 10, 2026 19:514,41261,551,29635,600,0001,017,0002,273,280
9Mar 10, 2026 19:514,41960,683,20235,660,0001,018,0002,490,368