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 23, 2025 16:10Lukas EschbacherLukas EschbacherScore: 327,987Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 23, 2025 16:10325,2562,724,590,2452,697,629,0001,998,0002,281,472
2Jan 23, 2025 16:10325,9232,731,784,5622,703,163,0001,998,0002,281,472
3Jan 23, 2025 16:10326,9072,742,941,2572,712,326,000999,0002,371,584
4Jan 23, 2025 16:10327,7692,747,953,9542,718,482,0001,998,0002,281,472
5Jan 23, 2025 16:10327,9872,754,827,2152,721,294,000999,0002,281,472
6Jan 23, 2025 16:10328,6402,754,532,3102,725,713,0001,999,0002,289,664
7Jan 23, 2025 16:10329,6832,770,067,0242,734,369,0001,998,0002,281,472
8Jan 23, 2025 16:10331,6792,779,132,7002,751,933,000999,0002,285,568
9Jan 23, 2025 16:10345,9002,902,085,5882,868,972,0001,998,0002,289,664