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 3, 2026 07:29Priyansh RathiPriyansh RathiScore: 47,787Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 3, 2026 07:2947,782424,875,409395,590,000998,0002,371,584
2Mar 3, 2026 07:2947,787423,537,060395,634,000999,0002,355,200
3Mar 3, 2026 07:2947,795423,885,687392,699,0003,996,0002,359,296