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 listMar 20, 2026 12:42Dominique GarmierDominique GarmierScore: 7,570Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 12:427,51289,040,48460,341,0002,011,0002,289,664
2Mar 20, 2026 12:427,54289,212,48861,589,0001,009,0002,289,664
3Mar 20, 2026 12:427,54789,904,43061,626,0001,010,0002,449,408
4Mar 20, 2026 12:427,56388,362,65361,774,000996,0002,289,664
5Mar 20, 2026 12:427,57092,035,15060,841,0001,994,0002,445,312
6Mar 20, 2026 12:427,57591,752,45160,877,0001,995,0002,289,664
7Mar 20, 2026 12:427,57594,998,07561,875,000997,0002,445,312
8Mar 20, 2026 12:427,58290,660,45860,931,0001,997,0002,289,664
9Mar 20, 2026 12:427,61288,390,18161,173,0002,005,0002,453,504