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 listMay 29, 2025 12:45GabriellaGabriellaScore: 70,370Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2025 12:4569,675604,556,510518,272,00060,031,0002,281,472
2May 29, 2025 12:4569,848603,777,997521,768,00057,974,0002,281,472
3May 29, 2025 12:4570,023608,079,036515,287,00065,908,0002,289,664
4May 29, 2025 12:4570,329608,214,421518,762,00064,970,0002,289,664
5May 29, 2025 12:4570,370606,709,210513,065,00071,009,0002,281,472
6May 29, 2025 12:4570,738615,156,923524,111,00063,013,0002,289,664
7May 29, 2025 12:4570,982610,538,091513,131,00076,019,0002,289,664
8May 29, 2025 12:4571,510620,750,482528,581,00064,948,0002,289,664
9May 29, 2025 12:4572,108632,236,896524,560,00073,938,0002,281,472