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 listJun 22, 2025 10:27Valentin KofmanValentin KofmanScore: 45,914Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2025 10:2745,498407,799,233375,635,0001,998,0002,281,472
2Jun 22, 2025 10:2745,502398,243,628375,665,0001,998,0002,289,664
3Jun 22, 2025 10:2745,883409,262,855378,834,0001,999,0002,277,376
4Jun 22, 2025 10:2745,911402,525,895379,059,0002,000,0002,273,280
5Jun 22, 2025 10:2745,914404,759,682379,086,0002,000,0002,273,280
6Jun 22, 2025 10:2745,920404,670,949379,136,0002,000,0002,289,664
7Jun 22, 2025 10:2745,928405,209,893379,198,0002,001,0002,277,376
8Jun 22, 2025 10:2745,930403,999,870379,214,0002,001,0002,269,184
9Jun 22, 2025 10:2745,963406,731,835380,496,000998,0002,289,664