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 listOct 10, 2025 01:13MustafaMustafaScore: 80,180Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 10, 2025 01:1380,059690,958,095599,538,00064,950,0002,277,376
2Oct 10, 2025 01:1380,076685,734,136609,658,00054,969,0002,277,376
3Oct 10, 2025 01:1380,129689,248,957611,063,00054,005,0002,285,568
4Oct 10, 2025 01:1380,140695,223,594619,151,00046,011,0002,285,568
5Oct 10, 2025 01:1380,180688,478,669609,537,00055,957,0002,379,776
6Oct 10, 2025 01:1380,240685,522,837613,997,00051,999,0002,523,136
7Oct 10, 2025 01:1380,440687,584,909593,687,00073,961,0002,285,568
8Oct 10, 2025 01:1380,450691,764,880639,748,00027,988,0002,285,568
9Oct 10, 2025 01:1380,563693,226,496603,702,00064,968,0002,277,376