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 listFeb 13, 2026 23:45Mikołaj UzarskiMikołaj UzarskiScore: 6,963Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 13, 2026 23:456,91181,401,41650,316,0007,044,0002,478,080
2Feb 13, 2026 23:456,93084,422,27851,461,0006,054,0002,277,376
3Feb 13, 2026 23:456,93285,674,96753,497,0004,037,0002,400,256
4Feb 13, 2026 23:456,95984,523,01251,782,0005,974,0002,375,680
5Feb 13, 2026 23:456,96384,224,35350,815,0006,974,0002,293,760
6Feb 13, 2026 23:457,01080,523,61252,164,0006,018,0002,408,448
7Feb 13, 2026 23:457,01080,144,16753,168,0005,015,0002,330,624
8Feb 13, 2026 23:457,01986,501,39753,238,0005,022,0002,453,504
9Feb 13, 2026 23:457,08392,165,57552,812,0005,978,0002,478,080