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 listJan 5, 2026 20:36lipapipalipapipaScore: 69,867Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 5, 2026 20:3669,806601,445,892517,454,00061,934,000315,392
2Jan 5, 2026 20:3669,825608,295,574514,599,00064,949,0002,416,640
3Jan 5, 2026 20:3669,852608,141,355515,796,00063,974,000307,200
4Jan 5, 2026 20:3669,860608,414,329519,853,00059,983,000311,296
5Jan 5, 2026 20:3669,867607,175,588516,905,00062,988,000311,296
6Jan 5, 2026 20:3669,979605,124,016522,845,00057,982,000307,200
7Jan 5, 2026 20:3669,982608,164,180511,869,00068,982,000307,200
8Jan 5, 2026 20:3670,121607,409,261514,006,00068,000,0002,273,280
9Jan 5, 2026 20:3670,999625,589,705515,384,00073,911,0002,412,544