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 listAug 31, 2025 20:51Adam FolwarcznyAdam FolwarcznyScore: 8,359Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2025 20:518,08592,935,96848,075,00019,029,0002,334,720
2Aug 31, 2025 20:518,09992,313,97746,154,00021,070,0002,334,720
3Aug 31, 2025 20:518,22490,904,81949,189,00019,073,0002,297,856
4Aug 31, 2025 20:518,359100,677,03355,301,00014,076,0002,289,664
5Aug 31, 2025 20:518,39192,820,92247,756,00021,888,0002,502,656
6Aug 31, 2025 20:518,434100,533,87349,003,00021,001,0002,293,760