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 19, 2026 02:18Ondřej PolaneckýOndřej PolaneckýScore: 9,623Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 02:189,613111,834,67178,791,000997,0002,273,280
2Mar 19, 2026 02:189,614106,249,26777,799,0001,994,0002,396,160
3Mar 19, 2026 02:189,618104,948,04277,837,0001,995,0002,269,184
4Mar 19, 2026 02:189,622101,287,59578,867,000998,0002,273,280
5Mar 19, 2026 02:189,623103,904,57777,879,0001,996,0002,273,280
6Mar 19, 2026 02:189,636101,347,25777,981,0001,999,0002,273,280
7Mar 19, 2026 02:189,637105,110,56477,984,0001,999,0002,273,280
8Mar 19, 2026 02:189,641104,503,20379,022,0001,000,0002,387,968
9Mar 19, 2026 02:189,648106,865,93878,077,0002,001,0002,387,968