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, 2024 12:10Joad NacerJoad NacerScore: 8,003Success
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, 2024 12:107,61389,466,84561,179,0002,005,0002,535,424
2Oct 10, 2024 12:107,61684,233,48962,210,0001,003,0002,535,424
3Oct 10, 2024 12:107,63380,921,45462,346,0001,005,0002,535,424
4Oct 10, 2024 12:108,00386,734,27566,426,00002,424,832
5Oct 10, 2024 12:108,01193,441,76566,490,00002,437,120
6Oct 10, 2024 12:108,13492,010,56266,522,000992,0002,433,024