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,657Success
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,877603,476,013518,982,00060,997,0002,289,664
2May 29, 2025 12:4570,251608,745,858521,077,00062,009,0002,273,280
3May 29, 2025 12:4570,253609,663,977523,090,00060,010,0002,281,472
4May 29, 2025 12:4570,404609,249,673518,316,00066,040,0002,289,664
5May 29, 2025 12:4570,657611,649,977523,511,00062,941,0002,289,664
6May 29, 2025 12:4570,694614,360,012524,784,00061,974,0002,269,184
7May 29, 2025 12:4570,827613,992,216522,882,00064,985,0002,289,664
8May 29, 2025 12:4570,843616,253,833518,995,00068,999,0002,269,184
9May 29, 2025 12:4571,873621,459,336527,598,00068,947,0002,281,472