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 4, 2025 04:32thatmagicalcatthatmagicalcatScore: 88,378Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 4, 2025 04:3288,283755,232,917731,747,000999,0002,363,392
2Jun 4, 2025 04:3288,306758,170,982730,937,0001,999,0002,285,568
3Jun 4, 2025 04:3288,314759,496,975731,004,0002,000,0002,355,200
4Jun 4, 2025 04:3288,369760,944,027731,466,0001,998,0002,355,200
5Jun 4, 2025 04:3288,378761,603,486731,539,0001,998,0002,351,104
6Jun 4, 2025 04:3288,457756,751,143734,195,00002,285,568
7Jun 4, 2025 04:3288,524755,446,883732,754,0001,999,0002,281,472
8Jun 4, 2025 04:3288,571761,824,587734,139,0001,000,0002,285,568
9Jun 4, 2025 04:3288,617762,153,293733,521,0001,998,0002,285,568