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 listDec 6, 2025 16:27Rajarshi BasuRajarshi BasuScore: 5,979Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 6, 2025 16:275,89573,024,43145,931,0002,995,0002,281,472
2Dec 6, 2025 16:275,90270,887,91845,987,0002,999,0002,289,664
3Dec 6, 2025 16:275,90574,397,65646,009,0003,000,0002,289,664
4Dec 6, 2025 16:275,90871,796,66546,035,0003,002,0002,371,584
5Dec 6, 2025 16:275,91771,991,19746,104,0003,006,0002,277,376
6Dec 6, 2025 16:275,91869,448,19746,114,0003,007,0002,289,664
7Dec 6, 2025 16:275,94873,860,13546,350,0003,022,0002,289,664
8Dec 6, 2025 16:275,97976,081,48447,600,0002,025,0002,281,472
9Dec 6, 2025 16:275,98679,275,38047,655,0002,027,0002,277,376
10Dec 6, 2025 16:276,01773,143,16646,947,0002,996,0002,531,328
11Dec 6, 2025 16:276,01775,220,26747,948,0001,997,0002,281,472
12Dec 6, 2025 16:276,03672,006,22747,092,0003,005,0002,269,184
13Dec 6, 2025 16:276,10072,848,59548,645,0001,985,0002,289,664
14Dec 6, 2025 16:276,13478,439,13047,920,0002,995,0002,285,568
15Dec 6, 2025 16:276,14474,300,74950,994,00002,265,088