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 23:28wnwnScore: 8,377Success
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 23:287,16781,739,76952,430,0007,057,0002,445,312
2Feb 15, 2026 23:287,17885,094,03851,500,0008,078,0002,457,600
3Feb 15, 2026 23:287,18696,778,47451,554,0008,086,0002,273,280
4Feb 15, 2026 23:288,32789,997,07160,096,0009,014,0002,428,928
5Feb 15, 2026 23:288,34095,512,82960,192,0009,028,0002,469,888
6Feb 15, 2026 23:288,34490,925,67960,225,0009,033,0002,408,448
7Feb 15, 2026 23:288,37797,926,67261,471,0008,061,0002,387,968
8Feb 15, 2026 23:288,44293,977,07961,062,0009,009,0002,326,528
9Feb 15, 2026 23:288,59097,561,39863,261,0008,033,0002,334,720
10Feb 15, 2026 23:288,60696,734,60165,391,0006,036,0002,465,792
11Feb 15, 2026 23:288,60896,039,29365,412,0006,038,0002,281,472
12Feb 15, 2026 23:288,67293,857,43063,977,0007,997,0002,457,600