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 listJan 15, 2026 17:13Jonathan GopelJonathan GopelScore: 63,457Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 15, 2026 17:1363,350552,046,398466,825,00058,977,0002,363,392
2Jan 15, 2026 17:1363,457551,712,419454,736,00071,958,0002,289,664
3Jan 15, 2026 17:1363,685553,672,529472,629,00055,956,0002,461,696