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 listApr 29, 2026 12:41TudyMTudyMScore: 39,492Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 12:4139,235341,453,867322,655,0002,996,0002,392,064
2Apr 29, 2026 12:4139,249344,637,053323,773,0001,998,0002,379,776
3Apr 29, 2026 12:4139,256342,211,138323,831,0001,998,0002,318,336
4Apr 29, 2026 12:4139,450348,779,475325,441,0002,002,0002,379,776
5Apr 29, 2026 12:4139,492345,529,828325,791,0001,998,0002,375,680
6Apr 29, 2026 12:4139,563348,605,850327,374,0001,001,0002,392,064
7Apr 29, 2026 12:4139,729351,782,626327,760,0001,998,0002,383,872
8Apr 29, 2026 12:4139,732348,350,238326,783,0002,998,0002,367,488
9Apr 29, 2026 12:4139,741346,118,587327,859,0001,999,0002,387,968