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 listDec 10, 2025 22:06pseppsepScore: 45,437Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 10, 2025 22:0645,347404,495,069374,376,0002,002,0002,273,280
2Dec 10, 2025 22:0645,361406,544,770374,496,0002,002,0002,523,136
3Dec 10, 2025 22:0645,390406,529,600369,745,0006,995,0002,273,280
4Dec 10, 2025 22:0645,432405,951,687375,084,0002,000,0002,269,184
5Dec 10, 2025 22:0645,437399,013,777376,130,0001,000,0002,273,280
6Dec 10, 2025 22:0645,442404,727,300375,171,0002,000,0002,260,992
7Dec 10, 2025 22:0645,453403,545,575377,261,00002,527,232
8Dec 10, 2025 22:0645,462404,283,742376,334,0001,000,0002,523,136
9Dec 10, 2025 22:0645,496404,577,030376,616,000998,0002,273,280