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 15, 2026 13:56Mikołaj UzarskiMikołaj UzarskiScore: 6,130Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 14:006,04776,792,90444,170,0006,023,0002,482,176
2Feb 15, 2026 14:006,05874,148,53446,259,0004,022,0002,285,568
3Feb 15, 2026 14:006,07274,195,75843,339,0007,055,0002,453,504
4Feb 15, 2026 14:006,08572,167,91144,446,0006,060,0002,510,848
5Feb 15, 2026 14:006,13082,577,19244,897,0005,986,0002,424,832
6Feb 15, 2026 14:006,13375,397,58844,916,0005,988,0002,449,408
7Feb 15, 2026 14:006,16375,732,39445,139,0006,018,0002,392,064
8Feb 15, 2026 14:006,19078,061,01744,326,0007,051,0002,445,312
9Feb 15, 2026 14:006,23878,721,20344,807,0006,970,0002,449,408