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 listNov 24, 2024 01:35MatthiasMatthiasScore: 35,346Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 24, 2024 01:3535,326315,748,999291,207,0002,001,0002,269,184
2Nov 24, 2024 01:3535,331319,236,218293,246,00002,289,664
3Nov 24, 2024 01:3535,333321,619,974291,261,0002,001,0002,289,664
4Nov 24, 2024 01:3535,344319,662,252291,356,0002,002,0002,289,664
5Nov 24, 2024 01:3535,346320,081,165292,371,0001,001,0002,289,664
6Nov 24, 2024 01:3535,367320,047,381291,546,0001,996,0002,289,664
7Nov 24, 2024 01:3535,369325,537,029293,560,00002,289,664
8Nov 24, 2024 01:3535,374323,410,108291,604,0001,997,0002,289,664
9Nov 24, 2024 01:3535,393318,499,995292,767,000999,0002,289,664